Adaptability Experiments in the RAID Distributed Database System

نویسندگان

  • Bharat Bhargava
  • Karl Friesen
  • Abdelsalam Helal
  • John Riedl
چکیده

Adaptable systems can improve reliability and performance by allowing dynamic reconfiguration. We are conducting a series of experiments on the RAID distributeel database system to siudy the cost and performance impHcations of providing static and dynamic adaptability, and for increasing the availabiliiy of daia iiems. Our studies of the cost of our adaptable implementation wefe conducted in the context of the concurrency controller and the replication controller. The experimentation with dynamic adaptability focuses on concurrency conlrol, and our examination of the costs of providing greater data availability studies thf! replication control and atomicity control subsystems of RAID. We show that for concurrency control and replicatioll control, adaptable implementations can be provided at costs comparable to those of speeial purpose algorithms. We also show that for our concurrency controller dynamic adaptability can result in performance benefits and that system reconfiguration can be accomplished dynamically with less cost than stopping the system, performing reconfiguration, and then restarting the syslem. In some cases, reconfiguration could be performed without aborting any transactions. We demonstrate some costs associated with increasing availability through replication control methods and use of a three-phase commil protocol. A system that can dynamically change to algorithms that increase availability can result in a 25-50% performance improvement over systems that continuously employ the algorithms that provide tIle better availallility. We show that the algorithms selected for replication control can significantly impact the time required fOf transaction commilmeul.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adapting Distributed Database Systems for High Availability

The availability offered by current data replication and update algorithms varies with dynamically changing conditions which include the network configuration and system load. With dynamic adaptability, systems can switch to an appropriate mechanism to improve perFormance and availability, In this paper, we present an algorithm to estimate the overall availability of transaction processing in a...

متن کامل

Evolution of a Communication System for Distributed Transaction Processing in Raid

This paper identifies the basic services required from a communication subsystem to support transaction processing in a distributed, reliable, reconfigurable, and replicated database environment. These services include multicasting, remote procedure calls (RPC), inexpensive datagram services, and efficient local interprocess communication (IPC). We show the evolution of the various versions of ...

متن کامل

A Model for Adaptable Systems for Transaction Processing

There is a need for adaptable systems that can change as requirements change, both in the long and the short term. Adaptability can reduce software costs and improve reliability and performance. Adaptability includes design techniques that support enhancement, retargeting to new projects, restructuring during different phases of a mission, and changing algorithms as external conditions. change....

متن کامل

Coinmunication in the Raid Distributed Database System

This paper identifies the basic functions required from a communication subsystem in order to support a distributed, reliable, reconfigurable, and replicated database environment. These functions include: reliable multicast, remote procedure calls (RPC) , inexpensive datagram services, and efficient local interprocess communication (IPC). Data obtained via a series of experiments that measure t...

متن کامل

A Model for Adaptable Concurrency Control

This research presents a model for an adaptable system that allows on-line switc:hing of classes of algorithms for database transaction processing. The basic idea is to identify conditions on the state of processing that will maintain consistency during the switch from one class to another. The classes of concurrency control algorithms and the formalism of history for transaction processing and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009